Subexponentially computable truncations of Jones-types polynomials
نویسندگان
چکیده
We show that an essential part of the new (Jones-type) polynomial link invariants can be computed in subexponential time. This is in a sharp contrast to the result of Jaeger, Vertigan and Welsh that computing the whole polynomial and most of its evaluations is #P-hard.
منابع مشابه
An Analytic Version of the Melvin-morton-rozansky Conjecture
To a knot in 3-space, one can associate a sequence of Laurent polynomials, whose nth term is the nth colored Jones polynomial. The Volume Conjecture for small angles states that the value of the n-th colored Jones polynomial at eα/n is a sequence of complex numbers that grows subexponentially, for a fixed small complex angle α. In an earlier publication, the authors proved the Volume Conjecture...
متن کاملColored Tutte Polynomials and Kauuman Brackets for Graphs of Bounded Tree Width
Jones polynomials and Kauuman polynomials are the most prominent invariants of knot theory. For alternating links, they are easily computable from the Tutte polynomials by a result of Thistlethwaite (1988), but in general one needs colored Tutte polynomials, as introduced by Bollobas and Riordan (1999). Knots and links can be presented as labeled planar graphs. The tree width of a link L is dee...
متن کاملThe Non-commutative A-polynomial of Twist Knots
The purpose of the paper is two-fold: to introduce a multivariable creative telescoping method, and to apply it in a problem of Quantum Topology: namely the computation of the non-commutative A-polynomial of twist knots. Our multivariable creative telescoping method allows us to compute linear recursions for sums of the form J(n) = P k c(n, k)Ĵ(k) given a recursion relation for (Ĵ(n)) a the hyp...
متن کاملComputable Function Representations Using Effective Chebyshev Polynomial
We show that Chebyshev Polynomials are a practical representation of computable functions on the computable reals. The paper presents error estimates for common operations and demonstrates that Chebyshev Polynomial methods would be more efficient than Taylor Series methods for evaluation of transcendental functions. Keywords—Approximation Theory, Chebyshev Polynomial, Computable Functions, Comp...
متن کاملComplete Problems for Valiant's Class of qp-Computable Families of Polynomials
We prove that the families matrix powering, iterated matrix product, and adjoint matrix are VQP{complete, where VQP denotes Valiant's class of quasipolynomial{computable families of multivariate polynomials. This proves a conjecture by B urgisser 3, Conjecture 8.1].
متن کامل